Force-Directed Method in Mirror Frames for Graph Drawing
نویسندگان
چکیده
منابع مشابه
A Force-Directed Method for Large Crossing Angle Graph Drawing
Recent empirical research has indicated that human graph reading performance improves when crossing angles increase. However, crossing angle has not been used as an aesthetic criterion for graph drawing algorithms so far. In this paper, we introduce a force-directed method that aims to construct graph drawings with large crossing angles. Experiments indicate that our method significantly increa...
متن کاملCurvilinear Graph Drawing Using the Force-Directed Method
We present a method for modifying a force-directed graph drawing algorithm into an algorithm for drawing graphs with curved lines. Our method is based on embedding control points as dummy vertices so that edges can be drawn as splines. Our experiments show that our method yields aesthetically pleasing curvilinear drawing with improved angular resolution. Applying our method to the GEM algorithm...
متن کاملEfficient, High-Quality Force-Directed Graph Drawing
We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach, which effectively overcomes local minimums, with the Barnes and Hut [1] octree technique, which approximates shortand long-range force efficiently. Our numerical results show that the algorithm is comparable in speed to Walshaw’s [2] highly efficient multilevel graph draw...
متن کاملGraph Drawing by Force-directed Placement
A graph G = (V,E) is a set V of vertices and a set E of edges, in which an edge joins a pair of vertices. 1 Normally, graphs are depicted with their vertices as points in a plane and their edges as line or curve segments connecting those points. There are different styles of representation, suited to different types of graphs or different purposes of presentation. We concentrate on the most gen...
متن کاملForce-Directed Lombardi-Style Graph Drawing
A Lombardi drawing of a graph is defined as one in which vertices are represented as points, edges are represented as circular arcs between their endpoints, and every vertex has perfect angular resolution (angles between consecutive edges, as measured by the tangents to the circular arcs at the vertex, all have the same degree). We describe two algorithms that create “Lombardi-style” drawings (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Systems and Applications
سال: 2010
ISSN: 2074-904X,2074-9058
DOI: 10.5815/ijisa.2010.01.02